Theoretically Investigating Optimal µ-Distributions for the Hypervolume Indicator: First Results for Three Objectives
نویسندگان
چکیده
Several indicator-based evolutionary multiobjective optimization algorithms have been proposed in the literature. The notion of optimal μ-distributions formalizes the optimization goal of such algorithms: find a set of μ solutions that maximizes the underlying indicator among all sets with μ solutions. In particular for the often used hypervolume indicator, optimal μ-distributions have been theoretically analyzed recently. All those results, however, cope with bi-objective problems only. It is the main goal of this paper to extend some of the results to the 3-objective case. This generalization is shown to be not straight-forward as a solution’s hypervolume contribution has not a simple geometric shape anymore in opposition to the bi-objective case where it is always rectangular. In addition, we investigate the influence of the reference point on optimal μ-distributions and prove that also in the 3-objective case situations exist for which the Pareto front’s extreme points cannot be guaranteed in optimal μ-distributions.
منابع مشابه
Optimal µ-Distributions for the Hypervolume Indicator for Problems with Linear Bi-objective Fronts: Exact and Exhaustive Results
To simultaneously optimize multiple objective functions, several evolutionary multiobjective optimization (EMO) algorithms have been proposed. Nowadays, often set quality indicators are used when comparing the performance of those algorithms or when selecting “good” solutions during the algorithm run. Hence, characterizing the solution sets that maximize a certain indicator is crucial—complying...
متن کاملHypervolume-based multiobjective optimization: Theoretical foundations and practical implications
In recent years, indicator-based evolutionary algorithms, allowing to implicitly incorporate user preferences into the search, have become widely used in practice to solve multiobjective optimization problems. When using this type of methods, the optimization goal changes from optimizing a set of objective functions simultaneously to the singleobjective optimization goal of finding a set of μ p...
متن کاملAn Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest loss with respect to the dominated hypervolume from the population. We present a new algorithm which determines for a population of size n with d objectives, a solution with minimal hypervolume contribution in time O(n(d...
متن کاملTight Bounds for the Approximation Ratio of the Hypervolume Indicator
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the dominated portion of the objective space which is considered to give a good approximation of the Pareto front. There is surprisingly little theoretically known about the quality of this approximation. We examine the m...
متن کاملICIC Express Letters
Hypervolume indicator is a commonly accepted quality measure for the Pareto optimal approximation set. But the calculation of hypervolume indicator is rather difficult, which greatly hampers its applications. Here we propose a slicing-based computation method (MHSO) to calculate hypervolume. MHSO processes objective space and points together. It recursively projects the set of points into fewer...
متن کامل